Fast symmetric matrix inversion using modified Gaussian elimination
نویسندگان
چکیده
In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time’s spending. Further, both of them can be used efficiently not only for positive (semi-) definite, but for any non-singular symmetric matrix inversion. We use simulation to verify results, which represented in this paper.
منابع مشابه
Symmetric matrix inversion using modified Gaussian elimination
In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time’s spending. Further, both of them can be used efficiently not only for positive (semi-) definite, but for any non-singular symmetric matrix inversion. We use simulation to verify results, ...
متن کاملA Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasise...
متن کاملSpeed Enhancement on a Matrix Inversion Hardware Architecture Based on Gauss-jordan Elimination Oh Eng Wei Universiti Teknologi Malaysia Speed Enhancement on a Matrix Inversion Hardware Architecture Based on Gauss-jordan Elimination Oh Eng Wei
Matrix inversion is a mathematical algorithm that is widely used and applied in many real time engineering applications. It is one of the most computational intensive and time consuming operations especially when it is performed in software. Gauss-Jordan Elimination is one of the many matrix inversion algorithms which has the advantage of using simpler mathematical operations to get the result....
متن کاملAsymptotically fast group operations on Jacobians of general curves
Let C be a curve of genus g over a field k. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of C. After a precomputation, which is done only once for the curve C, the algorithms use only linear algebra in vector spaces of dimension at most O(g log g), and so take O(g3+ ) field operations in k, using Gaussian elimination. Using ...
متن کاملOptimization by direct search in matrix computations
A direct search method attempts to maximize a function f l R using function values only. Many questions about the stability and accuracy of algorithms in matrix computations can be expressed in terms of the maximum value of some easily computable function f. For a variety of algorithms it is shown that direct search is capable of revealing instability or poor performance, even when such failure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015